An optimal routing scheme in space information networks was presented to balance network loads for heterogeneous users.\nAccording to the competition among the nodes, the model was built based on queuing game theory.The virtual routing platform\nwas in charge of resources allocation and route selection. It got user�s gain to decide which node the user joined in. Owning to\nthe existing of heterogeneous users, an optimal admission fee needed to be obtained to avoid congestion. In our model, firstly, the\nwhole welfare of the system was formulated. Then the optimal admission fee was calculated through maximizing the whole welfare.\nMeanwhile, the average maximum queue length was generated to set the buffer space of the node. At last, a routing factor was\nintroduced into the route algorithm in order that the optimal routing could be selected by heterogeneous users. As a result, the\nsystem welfare reaches the maximum.
Loading....